Associating domain-dependent knowledge and Monte Carlo approaches within a Go program
نویسندگان
چکیده
منابع مشابه
Associating domain-dependent knowledge and Monte Carlo approaches within a Go program
This paper underlines the association of two computer go approaches, a domaindependent knowledge approach and Monte Carlo. First, the strengthes and weaknesses of the two existing approaches are related. Then, the association is described in two steps. A first step consists in using domain-dependent knowledge within the random games enabling the program to compute evaluations that are more sign...
متن کاملMonte-Carlo Go Developments
We describe two Go programs, and , developed by a Monte-Carlo approach that is simpler than Bruegmann’s (1993) approach. Our method is based on Abramson (1990). We performed experiments to assess ideas on (1) progressive pruning, (2) all moves as first heuristic, (3) temperature, (4) simulated annealing, and (5) depth-two tree search within the Monte-Carlo framework. Progressive pruning and the...
متن کاملMonte Carlo Go
We present an algorithm for the board game go which attempts to find the best move by simulated annealing. Remarkably, without including any go knowledge beyond the rules, our implementation leads to a playing strength of about 25 kyu on a 9x9 board.
متن کاملAssociating Shallow and Selective Global Tree Search with Monte Carlo for 9*9 Go
This paper explores the association of shallow and selective global tree search with Monte Carlo in 9x9 go. This exploration is based on Olga and Indigo, two experimental Monte Carlo programs. We provide a min-max algorithm that iteratively deepens the tree until one move at the root is proved to be superior to the other ones. At each iteration, random games are started at leaf nodes to compute...
متن کاملMulti-agent Monte Carlo Go
In this paper we propose a Multi-Agent version of UCT Monte Carlo Go. We use the emergent behavior of a great number of simple agents to increase the quality of the Monte Carlo simulations, increasing the strength of the artificial player as a whole. Instead of one agent playing against itself, different agents play in the simulation phase of the algorithm, leading to a better exploration of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2005
ISSN: 0020-0255
DOI: 10.1016/j.ins.2004.04.010